More on Benveniste's dilution results"

More Results on Dynamic Cumulative Inaccuracy Measure

In this paper, borrowing the intuition in Rao et al. (2004), we introduce a cumulative version of the inaccuracy measure (CIM). Also we obtain interesting and applicable properties of CIM for different cases based on the residual, past and interval lifetime random variables. Relying on various applications of stochastic classes in reliability and information theory fields, we stu...

More results on overlapping squares

Three recent papers [5, 11, 8] have considered in complementary ways the combinatorial consequences of assuming that three squares overlap in a string. In this paper we provide a unifying framework for these results: we show that in 12 of 14 subcases that arise the postulated occurrence of three neighbouring squares forces a breakdown into highly periodic behaviour, thus essentially trivial and...

Lecture 8 : More Results on List Decoding

Proof. Let C be a binary code with minimum relative distance δ. Suppose x ∈ {0, 1} is arbitrary and c1, c2, . . . , cL ∈ C are codewords such that for all i, ∆ (x, ci) < ρn. Since each ci is a codeword, we have that ∆ (ci, cj) ≥ δn for all i 6= j. Let Φ : {0, 1} → Rn be the map sending 0 to 1 and 1 to −1. Define u = Φ (x), and, for all i, define vi = Φ (ci). Let ū = 1 √ n u denote the normaliza...

More rigorous results on the NK model

More results on weighted independent domination

Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in the classes of sat-graphs and chordal graphs. We strengthen these results by showing that the problem is NP-hard in a proper subclass of the intersection of sat-graphs and chordal graphs. On the other hand, we identify ...